RDF Entailment as a Graph Homomorphism
نویسنده
چکیده
Semantic consequence (entailment) in RDF is ususally computed using Pat Hayes Interpolation Lemma. In this paper, we reformulate this mechanism as a graph homomorphism known as projection in the conceptual graphs community. Though most of the paper is devoted to a detailed proof of this result, we discuss the immediate benefits of this reformulation: it is now easy to translate results from different communities (e.g. conceptual graphs, constraint programming, . . . ) to obtain new polynomial cases for the NPcomplete RDF entailment problem, as well as numerous algorithmic optimizations.
منابع مشابه
Constrained Regular Expressions in SPARQL
RDF is a knowledge representation language dedicated to the annotation of resources within the Semantic Web. Though RDF itself can be used as a query language for an RDF knowledge base (using RDF consequence), the need for added expressivity in queries has led to the definition of the SPARQL query language. SPARQL queries are defined on top of graph patterns that are basically RDF (and more pre...
متن کاملdRDF: Entailment for Domain-Restricted RDF
We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF is a real extension of RDF and discuss impacts on the complexity of entailment in dRDF. The entailment problem represents the key reasoning task for RDF and is well known to be NP-complete. Remarkably, we show that the restric...
متن کاملTowards In-Memory RDFS Entailment
1 Motivation Massive publication efforts have enriched the Web with huge amounts of semantic data represented in RDF [7], and reasoning tasks at such scale are a formidable challenge. RDF Schema (RDFS) [6] defines the most simple inference in RDF introducing a vocabulary with predefined semantics to describe relationships such as typing of entities and hierarchy relations in classes and propert...
متن کاملLogical Foundations of RDF(S) with Datatypes Logical Foundations of RDF(S) with Datatypes
The Resource Description Framework (RDF) is a Semantic Web standard that provides a data language, simply called RDF, as well as a lightweight ontology language, called RDF Schema. We investigate embeddings of RDF in logic and show how standard logic programming and description logic technology can be used for reasoning with RDF. We subsequently consider extensions of RDF with datatype support,...
متن کاملLogical Foundations of RDF(S) with Datatypes
The Resource Description Framework (RDF) is a Semantic Web standard that provides a data language, simply called RDF, as well as a lightweight ontology language, called RDF Schema. We investigate embeddings of RDF in logic and show how standard logic programming and description logic technology can be used for reasoning with RDF. We subsequently consider extensions of RDF with datatype support,...
متن کامل